Iterative Projection Methods for Large–scale Nonlinear Eigenvalue Problems
نویسنده
چکیده
In this presentation we review iterative projection methods for sparse nonlinear eigenvalue problems which have proven to be very efficient. Here the eigenvalue problem is projected to a subspace V of small dimension which yields approximate eigenpairs. If an error tolerance is not met then the search space V is expanded in an iterative way with the aim that some of the eigenvalues of the reduced matrix become good approximations to some of the wanted eigenvalues of the given large matrix. Methods of this type are the nonlinear Arnoldi method, the Jacobi–Davidson method, and the rational Krylov method.
منابع مشابه
Restarting iterative projection methods for Hermitian nonlinear eigenvalue problems with minmax property
In this work we present a new restart technique for iterative projection methods for nonlinear eigenvalue problems admitting minmax characterization of their eigenvalues. Our technique makes use of the minmax induced local enumeration of the eigenvalues in the inner iteration. In contrast to global numbering which requires including all the previously computed eigenvectors in the search subspac...
متن کاملProjection Methods for Nonlinear Sparse Eigenvalue Problems
This paper surveys numerical methods for general sparse nonlinear eigenvalue problems with special emphasis on iterative projection methods like Jacobi–Davidson, Arnoldi or rational Krylov methods and the automated multi–level substructuring. We do not review the rich literature on polynomial eigenproblems which take advantage of a linearization of the problem.
متن کاملMultiscale Algorithms for Eigenvalue Problems
Iterative multiscale methods for electronic structure calculations offer several advantages for large-scale problems. Here we examine a nonlinear full approximation scheme (FAS) multigrid method for solving fixed potential and self-consistent eigenvalue problems. In principle, the expensive orthogonalization and Ritz projection operations can be moved to coarse levels, thus substantially reduci...
متن کاملNonlinear Eigenvalue Problems
Heinrich Voss Hamburg University of Technology 115.1 Basic Properties . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115-2 115.2 Analytic matrix functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115-3 115.3 Variational Characterization of Eigenvalues . . . . . . . . 115-7 115.4 General Rayleigh Functionals . . . . . . . . . . . . . . . . . . . ...
متن کاملNonlinear Rayleigh-ritz Iterative Method for Solving Large Scale Nonlinear Eigenvalue Problems
A nonlinear Rayleigh-Ritz iterative (NRRIT) method for solving nonlinear eigenvalue problems is studied in this paper. It is an extension of the nonlinear Arnoldi algorithm due to Heinrich Voss. The effienicy of the NRRIT method is demonstrated by comparing with inverse iteration methods to solve a highly nonlinear eigenvalue problem arising from finite element electromagnetic simulation in acc...
متن کامل